applying robust optimization to solve product mix problem in automotive industries
نویسندگان
چکیده
applying robust optimization to solve product mix problem in automotive industries in this article, applying robust optimization in product mix problem in automotive industries is presented. the problem includes determining both the quantity and the identification of each product to produce to maximize profit. at first, the deterministic model will be presented. then, robust model of product mix problem will be illustrated. bertsimas and sim approach is used to build robust counterpart of deterministic model. in bertsimas and sim approach, the robust counterpart of deterministic model is linear and decision maker can decide about protection level. model can be used in many automotive industries under uncertainties.
منابع مشابه
A new heuristic approach to solve product mix problems in a multi-bottleneck system
Product mix problem (PMP) is one of the most important and complicated problems in production systems. Different approaches have been applied to solve this problem, among them, theory of constraints (TOC) has been widely considered since 1990s. This paper develops a distinguished algorithm to solve product mix prob-lems that is efficient both in single and multi-bottleneck problems. At first, t...
متن کاملa new heuristic approach to solve product mix problems in a multi-bottleneck system
product mix problem (pmp) is one of the most important and complicated problems in production systems. different approaches have been applied to solve this problem, among them, theory of constraints (toc) has been widely considered since 1990s. this paper develops a distinguished algorithm to solve product mix prob-lems that is efficient both in single and multi-bottleneck problems. at first, t...
متن کاملApplying Ant Colony Optimization to Solve the Single Machine Total Tardiness Problem
Ant Colony Optimization is a relatively new meta-heuristic that has proven its quality and versatility on various combinatorial optimization problems such as the traveling salesman problem, the vehicle routing problem and the job shop scheduling problem. The paper introduces an Ant Colony Optimization approach to solve the problem of determining a job-sequence that minimizes the overall tardine...
متن کاملApplying Two-Stage Ant Colony Optimization to Solve the Large Scale Vehicle Routing Problem
The vehicle routing problem (VRP) is an important problem in the field of logistics management. As an NP-hard problem, the VRP real world sized instances cannot be solved to optimality within reasonable times. This research aims to develop a two-stage ant colony optimization (TACO) algorithm, which possesses a two-stage solution construction rule, to solve the large scale vehicle routing proble...
متن کاملApplying Multiple Complementary Neural Networks to Solve Multiclass Classification Problem
In this paper, a multiclass classification problem is solved using multiple complementary neural networks. Two techniques are applied to multiple complementary neural networks which are one-against-all and error correcting output codes. We experiment our proposed techniques using an extremely imbalance data set named glass from the UCI machine learning repository. It is found that the combinati...
متن کاملApplying Genetic Algorithms to Solve the Fuzzy Optimal Profit Problem
This study investigated the application of genetic algorithms for solving a fuzzy optimization problem that arises in business and economics. In this problem, a fuzzy price is determined using a linear or a quadratic fuzzy demand function as well as a linear cost function. The objective is to find the optimal fuzzy profit, which is derived from the fuzzy price and the fuzzy cost. The traditiona...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
مدیریت صنعتیجلد ۱، شماره ۲، صفحات ۰-۰
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023